Localized LMST and RNG based minimum-energy broadcast protocols in ad hoc networks

In the minimum energy broadcasting problem, each node adjusts its transmission power to minimize the total energy consumption while still guaranteeing the full coverage of the network. We consider both topology control and broadcast oriented protocols, for which all existing solutions require global network information. In this paper, we describe new localized protocols where nodes require only local informations about their neighborhood (distances or geographic positions). In addition to this, our protocols are shown experimentally to be comparable to the best known globalized BIP solution. Our solutions are based on the use of neighbor elimination scheme applied on the relative neighborhood graph (RNG) and local minimum spanning tree (LMST) which preserve connectivity and are defined in localized manner. Two variants are proposed, one with timeout applied on nodes receiving message from non-RNG (non-LMST) neighbor and retransmitting immediately otherwise (unless list of RNG or LMST neighbors in need of the message is empty), and one with timeout applied on all the nodes. We proved that LMST is a subset of RNG, which explains why LMST always performs better among the two. 2003 Elsevier B.V. All rights reserved.